New Foundations for Imperative Logic Iv: Natural Deduction

نویسنده

  • Peter B. M. Vranas
چکیده

I present sound and complete natural deduction systems for (quantified modal) imperative logic, in five steps. (1) Syntax: I introduce imperative formal languages by using the imperative operator ‘!’; e.g., if ‘A’ is a declarative sentence, ‘!A’ (“let A be true’’) is an imperative sentence. (2) Semantics: I introduce interpretations of imperative formal languages, and (building on previous work) I define what it is for a declarative sentence to sustain a (declarative or imperative) sentence on an interpretation. (3) Semantic validity: I define an argument to be semantically valid exactly if, on every interpretation, every declarative sentence that sustains its premises also sustains its conclusion. (4) Syntactic validity: I define an argument to be syntactically valid exactly if its conclusion can be derived from its premises by applying certain “natural” replacement and inference rules that I introduce. (5) Soundness and completeness: I prove that semantic and syntactic validity coincide.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Twenty Years of Rewriting Logic

Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations; (ii) its semantic framework and logical fram...

متن کامل

Completeness of Category-Based Equational Deduction

Equational deduction is generalised within a category-based abstract model theory framework, and proved complete under a hypothesis of quantiier projectivity, using a semantic treatment that regards quantiiers as models rather than variables, and regards valuations as model morphisms rather than functions. Applications include many and order sorted conditional] equational logics, Horn clause lo...

متن کامل

Approximate anytime inference: Half an answer on time is better than a perfect answer too late

Many branches of computer science rely on logical formalisms as their foundations. Logic provides a very solid foundation on which to build new results: after 2500 years of research, logic provides us with a strong set of theoretical notions: model theory, proof theory, completeness, correctness; there exists a well established body of knowledge concerning properties such expressiveness, decida...

متن کامل

Bottom up Specialisation: towards General Foundations ?

In this abstract, we develop a solid theoretical foundation for a bottom-up program specialisation technique, capable of specialising a logic program w.r.t. a set of unit clauses. Extending a well-known operator, originally introduced for composing logic programs, we deene a bottom-up partial deduction operator and prove correctness of the transformation with respect to the S-semantics.

متن کامل

Automated Deduction for Deontic Logics: Laying the Foundations of Legal Expert Systems

ABSTRACT: Deontic logic can be used to formalise legal rules. The automation of reasoning in deontic logic can therefore be used as the basis of a legal expert system. In this paper we investigate the automation of deontic logic using tableau calculi for modal logics. The correspondance between the deontic and modal logics is outlined and the tableau for the modal logics used in the prover are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013